Optimizing Probabilities in Probabilistic Logic Programs

نویسندگان

چکیده

Probabilistic Logic Programming is an effective formalism for encoding problems characterized by uncertainty. Some of these may require the optimization probability values subject to constraints among distributions random variables. Here, we introduce a new class probabilistic logic programs, namely Optimizable Programs, and provide algorithm find best assignment probabilities variables, such that set satisfied objective function optimized. This paper under consideration acceptance in Theory Practice Programming.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Negative probabilities in probabilistic logic programs

Article history: Received 29 January 2016 Received in revised form 11 July 2016 Accepted 6 October 2016 Available online 13 October 2016

متن کامل

Optimizing Inference for Probabilistic Logic Programs Exploiting Independence and Exclusiveness

Probabilistic Logic Programming (PLP) is gaining popularity due to its many applications in particular in Machine Learning. An important problem in PLP is how to compute the probability of queries. PITA is an algorithm for solving such a problem that exploits tabling, answer subsumption and Binary Decision Diagrams (BDDs). PITA does not impose any restriction on the programs. Other algorithms, ...

متن کامل

Temporal Probabilistic Logic Programs

There are many applications where the precise time at which an event will occur (or has occurred) is uncertain. Temporal probabilistic logic programs (TPLPs) allow a programmer to express knowledge about such events. In this paper, we develop a model theory, xpoint theory, and proof theory for TPLPs, and show that the xpoint theory may be used to enumerate consequences of a TPLP in a sound and ...

متن کامل

Probabilistic Description Logic Programs

Towards sophisticated representation and reasoning techniques that allow for probabilistic uncertainty in the Rules, Logic, and Proof layers of the Semantic Web, we present probabilistic description logic programs (or pdl-programs), which are a combination of description logic programs (or dl-programs) under the answer set semantics and the well-founded semantics with Poole’s independent choice...

متن کامل

Optimizing Clause Resolution in Tabled Logic Programs

The incorporation of tabulation into resolution methods ((3, 5]) has proven eeective for computing the well-founded semantics in a goal-oriented manner. It has also given rise to an extremely eecient evaluation method for in-memory deductive databases 12]. Perhaps because these results are quite recent, the problem of optimizing tabled clause resolution has remained open, despite the fact that ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theory and Practice of Logic Programming

سال: 2021

ISSN: ['1471-0684', '1475-3081']

DOI: https://doi.org/10.1017/s1471068421000260